Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees

نویسنده

  • Sylvain Pogodalla
چکیده

This paper proposes a process to build semantic representation for Tree Adjoining Grammars (TAGs) analysis. Being in the derivation tree tradition, it proposes to reconsider derivation trees as abstract terms (λ-terms) of Abstract Categorial Grammars (ACGs). The latter offers a flexible tool for expliciting compositionality and semantic combination. The chosen semantic representation language here is an underspecified one. The ACG framework allows to deal both with the semantic language and the derived tree language in an equivalent way: as concrete realizations of the abstract terms. Then, in the semantic part, we can model linguistic phenomena usually considered as difficult for the derivation tree approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constituency and Dependency Relationship from a Tree Adjoining Grammar and Abstract Categorial Grammars Perspective

This paper gives an Abstract Categorial Grammar (ACG) account of (Kallmeyer and Kuhlmann, 2012)’s process of transformation of the derivation trees of Tree Adjoining Grammar (TAG) into dependency trees. We make explicit how the requirement of keeping a direct interpretation of dependency trees into strings results into lexical ambiguity. Since the ACG framework has already been used to provide ...

متن کامل

Applicative Abstract Categorial Grammars in Full Swing

Recently introduced Applicative Abstract Categorial Grammars (AACG) extend the Abstract Categorial Grammar (ACG) formalism to make it more suitable for semantic analyses while preserving all of its benefits for syntactic analyses. The surface form of a sentence, the abstract (tecto-) form, as well as the meaning are all uniformly represented in AACG as typed terms, or trees. The meaning of a se...

متن کامل

Semantic Composition for Partial Proof Trees

We address the problem of semantic composition in a categorial system based on a hybrid logic. One logic is used for unfolding a categorial type, resulting in a partial derivation. The second logic computes the semantic representation from those partial derivations. We encode the history of the derivation from the rst logic by using bound variables to represent the missing assumptions. Since th...

متن کامل

1 Generating Control Languages with

We show that the class of level-k control languages, as defined by Weir, is properly included in the class of 2 k−1-multiple context-free languages for each k ≥ 2. The proof of inclusion uses a representation of the set of derivation trees for a level-k control language in terms of a second-order abstract categorial grammar. 1.1 Introduction Weir (1992a) introduced a hierarchy of language class...

متن کامل

Text Generation: Reexamining G-TAG with Abstract Categorial Grammars (Génération de textes : G-TAG revisité avec les Grammaires Catégorielles Abstraites) [in French]

G-TAG is a formalism dedicated to text generation. It relies on the Tree Adjoining Grammar (TAG) formalism and extends it with several specific notions allowing for the construction of a surface form from a conceptual representation. This conceptual representation is independent from the target language. The goal of this paper is to study G-TAG and its specific notions from the perspective give...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004